Invariant measures of modified LR and L+R systems
نویسندگان
چکیده
منابع مشابه
Invariant subspaces of nilpotent operators and LR-sequences
It is well-known that an operator in a finite-dimensional vector space is uniquely determined up to a similarity by its Jordan model. Given an operator T , two invariant subspaces M and N of T are said to be similar if there exists an invertible operator X such that XT = TX and XM = N . Clearly this is an equivalence relation in the lattice of invariant subspaces of T . Our paper was originally...
متن کاملLR - parsing
LR-parsing Kyung-Goo Doh, Hyunha Kim, David A. Schmidt 1 Hanyang University, Ansan, South Korea 2 Kansas State University, Manhattan, Kansas, USA Abstract. We combine LR(k)-parsing technology and data-flow analysis to analyze, in advance of execution, the documents generated dynamically by a program. Based on the document language’s context-free reference grammar and the program’s control struc...
متن کاملNotes on Lr Parser Design Christer Samuelsson 2 Lr Parsing
1 INTRODUCTION This paper discusses the design of an LR parser for a speciic high-coverage English grammar. The design principles, though, are applicable to a large class of uniication-based grammars where the constraints are realized as Prolog terms and applied monotonically through instantiation, where there is no right movement , and where left movement is handled by gap threading. The LR pa...
متن کاملGeneralised Reduction Modified LR Parsing for Domain Specific Language Prototyping
Domain specific languages should support syntax that is comfortable for specialist users. We discuss the impact of the standard deterministic parsing techniques such as LALR(1) and LL(1) on the design of programming languages and the desirability of more flexible parsers in a development environment. We present a new bottom-up nondeterministic parsing algorithm (GRMLR) that combines a modified ...
متن کاملLR-visibility in Polygons
We give a linear-time algorithm which, for a simple polygon P, computes all pairs of points s and t on P that admit LR-visibility. The points s and t partition P into two subchains. We say that P is LR-visible with respect to s and t if each point of P on the chain from s to t is visible from some point of the chain from t to s and vice-versa.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Regular and Chaotic Dynamics
سال: 2015
ISSN: 1560-3547,1468-4845
DOI: 10.1134/s1560354715050032